Efficiently solving very large-scale routing problems
نویسندگان
چکیده
منابع مشابه
Solving Evacuation Problems Efficiently —
Earliest arrival flows capture the essence of evacuation planning. Given a network with capacities and transit times on the arcs, a subset of source nodes with supplies and a sink node, the task is to send the given supplies from the sources to the sink “as quickly as possible”. The latter requirement is made more precise by the earliest arrival property which requires that the total amount of ...
متن کاملOn Very Large Scale Assignment Problems
In this paper we present computational testing results on very large scale random assignment problems. We consider a fully dense assignment problem with 2n nodes. Some conjectured or derived properties regarding fully dense assignment problems including the convergence of the optimal objective function value and the portion of nodes assigned with their kth best arc have been verified for networ...
متن کاملTensor Decompositions for Very Large Scale Problems
Modern applications such as neuroscience, text mining, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensionality. Tensors (i.e., multi-way arrays) provide a natural representation for such massive data. Consequently, tensor decompositions and factorizations are emerging as novel and promising tools for exploratory analysis of multidimensional...
متن کاملEfficiently solving large-scale graph problems on high-performance computing systems
My dissertation focuses on the design, analysis, and implementation of novel parallel approaches to solve massive graph problems. The graph abstractions we study are motivated by real-world social, biological and technological network applications. With a combination of novel parallel approaches and algorithm engineering for small-world networks, we achieve up to two orders of magnitude speedup...
متن کاملDecomposing Isotonic Regression for Efficiently Solving Large Problems
A new algorithm for isotonic regression is presented based on recursively partitioning the solution space. We develop efficient methods for each partitioning subproblem through an equivalent representation as a network flow problem, and prove that this sequence of partitions converges to the global solution. These network flow problems can further be decomposed in order to solve very large prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2019
ISSN: 0305-0548
DOI: 10.1016/j.cor.2019.03.006